The Banach-Mazur distance between the trace classes $c\sp{n}\sb{p}$
نویسندگان
چکیده
منابع مشابه
THE BANACH - MAZUR DISTANCE BETWEEN THE TRACE CLASSES c /
The Banach-Mazur distance between l2 ® l2 and l2 ® l2 is shown to be of the order Vmin(«,m) . Our proof yields that the distance between the trace classes c¡¡ and c¡¡ is of the same order as d(l£, l£). In this note we determine the distances between some tensor products of Euclidean spaces l2, k = 1, 2 ... . Let E, F be finite dimensional Banach spaces over the real field. The Banach-Mazur dist...
متن کامل2 Separating Hyperplanes 3 Banach–mazur Distance
We’ll use the above result to show why the polar of the polar of a convex body is the body itself. Recall that for a convex body K, we had defined its polar K∗ to be {p|k · p ≤ 1∀k ∈ K}. Theorem 2 Let K be a convex body. Then K∗∗ = K. Proof We know that K∗ = {p|k · p ≤ 1∀k ∈ K}. Similarly K∗∗ = {y|p · y ≤ 1∀p ∈ k∗}. Let y be any point in K. Then, by the definition of the polar, for all p ∈ K∗ w...
متن کاملRestricted Invertibility and the Banach-mazur Distance to the Cube
We prove a normalized version of the restricted invertibility principle obtained by Spielman-Srivastava in [15]. Applying this result, we get a new proof of the proportional Dvoretzky-Rogers factorization theorem recovering the best current estimate in the symmetric setting while we improve the best known result in the nonsymmetric case. As a consequence, we slightly improve the estimate for th...
متن کاملOn the Banach-mazur Distance between the Cube and the Crosspolytope
In this note we study the Banach-Mazur distance between the n-dimensional cube and the crosspolytope. Previous work shows that the distance has order √ n, and here we will prove some explicit bounds improving on former results. Even in dimension 3 the exact distance is not known, and based on computational results it is conjectured to be 9 5 . Here we will also present computerbased potential o...
متن کاملBanach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token through a directed graph, thus tracing out an infinite path, have numerous applications in different branches of mathematics and computer science. In the usual format, the possible moves of the players are given by the edges ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1978
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1978-0507329-5